Localized eigenvector of the non-backtracking matrix
نویسنده
چکیده
Emergence of localized eigenvectors can cause a failure of standard spectral method for graph partitioning. The spectral method using the non-backtracking matrix was proposed as a way to overcome this problem. The numerical experiments on several examples of real networks show that, indeed, the non-backtracking matrix does not exhibit localization of eigenvectors. We show that, however, localized eigenvectors of the non-backtracking matrix out of the spectral band can exist, deteriorating the performance of graph partitioning.
منابع مشابه
Non-Backtracking Centrality Based Random Walk on Networks
Random walks are a fundamental tool for analyzing realistic complex networked systems and implementing randomized algorithms to solve diverse problems such as searching and sampling. For many real applications, their actual effect and convenience depend on the properties (e.g. stationary distribution and hitting time) of random walks, with biased random walks often outperforming traditional unb...
متن کاملDistinct types of eigenvector localization in networks
The spectral properties of the adjacency matrix provide a trove of information about the structure and function of complex networks. In particular, the largest eigenvalue and its associated principal eigenvector are crucial in the understanding of nodes' centrality and the unfolding of dynamical processes. Here we show that two distinct types of localization of the principal eigenvector may occ...
متن کاملIterative Weighted Non-smooth Non-negative Matrix Factorization for Face Recognition
Non-negative Matrix Factorization (NMF) is a part-based image representation method. It comes from the intuitive idea that entire face image can be constructed by combining several parts. In this paper, we propose a framework for face recognition by finding localized, part-based representations, denoted “Iterative weighted non-smooth non-negative matrix factorization” (IWNS-NMF). A new cost fun...
متن کاملCentrality metrics and localization in core-periphery networks
Two concepts of centrality have been defined in complex networks. The first considers the centrality of a node and many different metrics for it has been defined (e.g. eigenvector centrality, PageRank, non-backtracking centrality, etc). The second is related to a large scale organization of the network, the core-periphery structure, composed by a dense core plus an outlying and loosely-connecte...
متن کاملNon-Backtracking Spectrum of Degree-Corrected Stochastic Block Models
Motivated by community detection, we characterise the spectrum of the non-backtracking matrix B in the Degree-Corrected Stochastic Block Model. Specifically, we consider a random graph on n vertices partitioned into two equalsized clusters. The vertices have i.i.d. weights {φu}u=1 with second moment Φ. The intra-cluster connection probability for vertices u and v is φuφv n a and the inter-clust...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1505.07543 شماره
صفحات -
تاریخ انتشار 2015